Rainbow meanders and Cartesian billiards

نویسندگان

  • Bernold Fiedler
  • Pablo Castañeda
چکیده

In this paper we relate several objects from quite diverse areas of mathematics. Closed meanders are the configurations which arise when one or several disjoint closed Jordan curves in the plane intersect the horizontal axis transversely. The question of their connectivity also arises when evaluating traces in Temperley-Lieb algebras. The variant of open meanders is closely related to the detailed dynamics of Sturm global attractors, i.e. the global attractors of parabolic PDEs in one space dimension; see the groundbreaking work of Fusco and Rocha [FuRo91]. Cartesian billiards have their corners located on the integer Cartesian grid with corner angles of ±90 degrees. Billiard paths are at angles of ±45 degrees with the boundaries and reflect at half-integer coordinates. We indicate and explore some close connections between these seemingly quite different objects.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the outer independent 2-rainbow domination number of Cartesian products of paths and cycles

‎Let G be a graph‎. ‎A 2-rainbow dominating function (or‎ 2-RDF) of G is a function f from V(G)‎ ‎to the set of all subsets of the set {1,2}‎ ‎such that for a vertex v ∈ V (G) with f(v) = ∅, ‎the‎‎condition $bigcup_{uin N_{G}(v)}f(u)={1,2}$ is fulfilled‎, wher NG(v)  is the open neighborhood‎‎of v‎. ‎The weight of 2-RDF f of G is the value‎‎$omega (f):=sum _{vin V(G)}|f(v)|$‎. ‎The 2-rainbow‎‎d...

متن کامل

On the rainbow connection of Cartesian products and their subgraphs

Rainbow connection number of Cartesian products and their subgraphs are considered. Previously known bounds are compared and non-existence of such bounds for subgraphs of products are discussed. It is shown that the rainbow connection number of an isometric subgraph of a hypercube is bounded above by the rainbow connection number of the hypercube. Isometric subgraphs of hypercubes with the rain...

متن کامل

The 3-rainbow index of graph operations

A tree T , in an edge-colored graph G, is called a rainbow tree if no two edges of T are assigned the same color. A k-rainbow coloring of G is an edge coloring of G having the property that for every set S of k vertices of G, there exists a rainbow tree T in G such that S ⊆ V (T ). The minimum number of colors needed in a k-rainbow coloring of G is the k-rainbow index of G, denoted by rxk(G). G...

متن کامل

Rainbow Domination in Graphs

Assume we have a set of k colors and to each vertex of a graph G we assign an arbitrary subset of these colors. If we require that each vertex to which an empty set is assigned has in its neighborhood all k colors, then this is called the k-rainbow dominating function of a graph G. The corresponding invariant γrk(G), which is the minimum sum of numbers of assigned colors over all vertices of G,...

متن کامل

Reversibility, Continued Fractions, and Infinite Meander Permutations of Planar Homoclinic Obits in Linear Hyperbolic Anosov Maps

Meander permutations have been encountered in the context of Gauss words, singularity theory, Sturm global attractors, plane Cartesian billiards, and Temperley-Lieb algebras, among others. In this spirit we attempt to investigate the difference of orderings of homoclinic orbits on the stable and unstable manifolds of a planar saddle. As an example we consider reversible linear Anosov maps on th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013